Knowledge Ecological Trees in Factor Space

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knowledge Extraction from the Neural ‘Black Box’ in Ecological Monitoring

Phytoplankton biomass within the Saginaw Bay ecosystem (Lake Huron, Michigan, USA) was characterized as a function of select physical/chemical indicators. The complexity and variability of ecological systems typically make it difficult to model the influences of anthropogenic stressors and/or natural disturbances. Here, Artificial Neural Networks (ANNs) were developed to model chlorophyll a con...

متن کامل

Ecological Knowledge in Community Theater

In his article "Ecological Knowledge in Community T tioner's perspective on plays which complex environmental problems. Community plays can highlight environmental injustices and assist communities to find a voice. The center-stage in community plays, and the role of community arts, alongside scientific research, in developing and communicating shared understanding of environmental problems and...

متن کامل

B-slack Trees: Space Efficient B-Trees

B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(logb n), where b is the maximum node degree. Updates can be performed in O(log b 2 n) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.

متن کامل

Space-Filling Trees

This paper introduces the notion of space-filling trees, which are analogous to space-filling curves, but have a branching, tree-like structure and are rooted. A space-filling tree is defined by an incremental process that results in a tree for which every point in the space has a finite-length path that converges to it. In contrast to space-filling curves, individual paths in the tree are shor...

متن کامل

Space Eecient Suux Trees

We give the rst representation of a suux tree that uses n lg n + O(n) bits of space and supports searching for a pattern string in the given text (from a xed size alphabet) in O(m) time, where n is the size of the text and m is the length of the pattern. The structure is quite simple and answers a question raised by Muthukrishnan in 22]. Previous compact representations of suux trees had either...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings

سال: 2017

ISSN: 2504-3900

DOI: 10.3390/is4si-2017-04079